The bulk-synchronous parallel random access machine

The Bulk-Synchronous Parallel Random Access Machine

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Originally, BSP was defined as a distributed memory model. Shared-memory style BSP programming had to be provided by PRAM simulation. However, this approach destroys data locality and therefore may prove inefficient for many practical problems. In this paper we present a new B...

A Parallel Categorical Abstract Machine for Bulk Synchronous Parallel ML

We have designed a functional data-parallel language called BSML for programming bulksynchronous parallel (BSP) algorithms in so-called direct mode. In a direct-mode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and dead-locks and indeterminism are avoided. The BSMLlib library has been implemented for the Objective Caml language. B...

A Parallel Virtual Machine for Bulk Synchronous Parallel ML

Bulk Synchronous Parallel ML or BSML is an extension of ML for programming direct-mode parallel Bulk Synchronous Parallel algorithms as functional programs. Bulk-Synchronous Parallel (BSP) computing is a parallel programming model introduced by Valiant [20] to offer a high degree of abstraction like PRAM models and yet allow portable and predictable performance on a wide variety of architecture...

Direct Bulk-Synchronous Parallel Algorithms

Parallel Superposition for Bulk Synchronous Parallel ML

The BSMLlib is a library for Bulk Synchronous Parallel programming with the functional language Objective Caml. It is based on an extension of the λ-calculus by parallel operations on a parallel data structure named parallel vector, which is given by intention. Those operations are flat and allow BSP programming in direct mode but it is impossible to express directly divide-and-conquer algorith...